Bounded harmonic but no Dirichlet-finite harmonic
نویسندگان
چکیده
منابع مشابه
Rough Isometries and Dirichlet Finite Harmonic Functions on Graphs
Suppose that G\ and G% are roughly isometric connected graphs of bounded degree. If G\ has no nonconstant Dirichlet finite harmonic functions, then neither has Gi.
متن کاملHarmonic Polynomials and Dirichlet-Type Problems
We take a new approach to harmonic polynomials via differentiation. Surprisingly powerful results about harmonic functions can be obtained simply by differentiating the function |x|2−n and observing the patterns that emerge. This is one of our main themes and is the route we take to Theorem 1.7, which leads to a new proof of a harmonic decomposition theorem for homogeneous polynomials (Corollar...
متن کاملInvariant Percolation and Harmonic Dirichlet Functions
The main goal of this paper is to answer question 1.10 and settle conjecture 1.11 of BenjaminiLyons-Schramm [BLS99] relating harmonic Dirichlet functions on a graph to those on the infinite clusters in the uniqueness phase of Bernoulli percolation. We extend the result to more general invariant percolations, including the Random-Cluster model. We prove the existence of the nonuniqueness phase f...
متن کاملChromatic Harmonic Indices and Chromatic Harmonic Polynomials of Certain Graphs
In the main this paper introduces the concept of chromatic harmonic polynomials denoted, $H^chi(G,x)$ and chromatic harmonic indices denoted, $H^chi(G)$ of a graph $G$. The new concept is then applied to finding explicit formula for the minimum (maximum) chromatic harmonic polynomials and the minimum (maximum) chromatic harmonic index of certain graphs. It is also applied to split graphs and ce...
متن کاملDirichlet Harmonic Shape Compression with Feature Preservation for Parameterized Surfaces
With the rapid advancement of 3D scanning devices, large and complicated 3D shapes are becoming ubiquitous, and require large amount of resources to store and transmit them efficiently. This makes shape compression a demanding technique in order for the user to reduce the data transmission latency. Existing shape compression methods could achieve very low bit-rates by sacrificing shape quality....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the American Mathematical Society
سال: 1973
ISSN: 0002-9904
DOI: 10.1090/s0002-9904-1973-13233-1